منابع مشابه
Real Rank and Topological Dimension of Higher Rank Graph Algebras
We study dimension theory for the C∗-algebras of row-finite k-graphs with no sources. We establish that strong aperiodicity—the higher-rank analogue of condition (K)—for a k-graph is necessary and sufficient for the associated C∗-algebra to have topological dimension zero. We prove that a purely infinite 2-graph algebra has real-rank zero if and only if it has topological dimension zero and sat...
متن کاملThe topological dimension of limits of graph substitutions
In 1998, J. Previte developed a framework for studying the dynamics of iterated replacements of certain vertices in a finite graph G by a finite graph H (see [3]). He showed that, except for special cases, the sequence of graphs formed by iterating vertex replacements converges in the Gromov-Hausdor¤ metric. In this paper we prove that the topological dimension of these limit spaces is one. We ...
متن کاملAnalysis of Resting-State fMRI Topological Graph Theory Properties in Methamphetamine Drug Users Applying Box-Counting Fractal Dimension
Introduction: Graph theoretical analysis of functional Magnetic Resonance Imaging (fMRI) data has provided new measures of mapping human brain in vivo. Of all methods to measure the functional connectivity between regions, Linear Correlation (LC) calculation of activity time series of the brain regions as a linear measure is considered the most ubiquitous one. The strength of the dependence obl...
متن کاملDistance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملDimension-Extended Topological Relationships
analysis. In Proc. 21st Int. Conf. on Machine Learning, 2004. 5. Ding C., He X., Zha H., and Simon H. Unsupervised learning: self-aggregation in scaled principal component space. Principles of Data Mining and Knowledge Discovery, 6th European Conf., 2002, pp. 112–124. 6. Fiedler M. Algebraic connectivity of graphs. Czech. Math. J., 23:298–305, 1973. 7. Hagen M. and Kahng A.B. New spectral metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.10.003